package hot100.logos91To100;

/**
 * @author logos
 * date 2025/7/18 19:08
 * @version v1.0
 * @Package hot100.logos91To100
 */
public class logos91 {

    /**
     * 91. 不同路径
     * https://leetcode.cn/problems/unique-paths/?envType=study-plan-v2&envId=top-100-liked
     */

    class Solution {
        public int uniquePaths(int m, int n) {
            int[][] dp = new int[m][n];
            for (int i = 0; i < m; i++) {
                dp[i][0] = 1;
            }
            for (int j = 0; j < n; j++) {
                dp[0][j] = 1;
            }
            for (int i = 1; i < m; i++) {
                for (int j = 1; j < n; j++) {
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                }
            }
            return dp[m - 1][n - 1];
        }
    }
}
